Game / Scenario - Based Tasks : An Edit Distance Approach
نویسندگان
چکیده
منابع مشابه
Analyzing Process Data from Game/Scenario- Based Tasks: An Edit Distance Approach
Students’ activities in game/scenario-based tasks (G/SBTs) can be characterized by a sequence of time-stamped actions of different types with different attributes. For a subset of G/SBTs in which only the order of the actions is of great interest, the process data can be well characterized as a string of characters (i.e., action string) if we encode each action name as a single character. In th...
متن کاملPartSS: An Efficient Partition-based Filtering for Edit Distance Constraints
This paper introduces PartSS, a new partition-based filtering for tasks performing string comparisons under edit distance constraints. PartSS offers improvements over the state-of-the-art method NGPP with the implementation of a new partitioning scheme and also improves filtering abilities by exploiting theoretical results on shifting and scaling ranges, thus accelerating the rate of calculatin...
متن کاملAn Exact Graph Edit Distance Algorithm for Solving Pattern Recognition Problems
Graph edit distance is an error tolerant matching technique emerged as a powerful and flexible graph matching paradigm that can be used to address different tasks in pattern recognition, machine learning and data mining; it represents the minimum-cost sequence of basic edit operations to transform one graph into another by means of insertion, deletion and substitution of vertices and/or edges. ...
متن کاملConceptual Neighborhoods for Retrieval in Case-Based Reasoning
We present a case-based reasoning technique based on conceptual neighborhoods of cases. The system applies domain knowledge to the case retrieval process in the form of recall and generalize methods. Recall methods utilize domain specific preconditions and perform exact matching, while generalize methods apply transformations that generalize features in queries. The system uses a similarity fun...
متن کاملA parallel graph edit distance algorithm
Graph edit distance (GED) has emerged as a powerful and flexible graph matching paradigm that can be used to address different tasks in pattern recognition, machine learning, and data mining. GED is an error-tolerant graph matching problem which consists in minimizing the cost of the sequence that transforms a graph into another by means of edit operations. Edit operations are deletion, inserti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015